Operator-free sparse domination

نویسندگان

چکیده

Abstract We obtain a sparse domination principle for an arbitrary family of functions $f(x,Q)$ , where $x\in {\mathbb R}^{n}$ and Q is cube in ${\mathbb . When applied to operators, this result recovers our recent works [37, 39]. On the other hand, can be also non-operator objects. In particular, we show applications generalised Poincaré–Sobolev inequalities, tent spaces general dyadic sums. Moreover, flexibility allows us treat operators that are not localisable sense [39], as will demonstrate application vector-valued square functions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domination and Total Domination on Asteroidal Triple-free Graphs

We present the first polynomial time algorithms for solving the NPcomplete graph problems DOMINATING SET and TOTAL DOMINATING SET when restricted to asteroidal triple-free graphs. We also present algorithms to compute a minimum cardinality dominating set and a minimum cardinality total dominating set on a large superclass of the asteroidal triple-free graphs, called DDP-graphs. These algorithms...

متن کامل

Claw-Free Graphs with Equal 2-Domination and Domination Numbers

For a graph G a subsetD of the vertex set of G is a k-dominating set if every vertex not in D has at least k neighbors in D. The k-domination number γk(G) is the minimum cardinality among the k-dominating sets of G. Note that the 1-domination number γ1(G) is the usual domination number γ(G). Fink and Jacobson showed in 1985 that the inequality γk(G) ≥ γ(G) + k − 2 is valid for every connected g...

متن کامل

Data-Sparse Approximation to Operator-Valued Functions of Elliptic Operator

In previous papers the arithmetic of hierarchical matrices has been described, which allows to compute the inverse, for instance, of finite element stiffness matrices discretising an elliptic operator L. The required computing time is up to logarithmic factors linear in the dimension of the matrix. In particular, this technique can be used for the computation of the discrete analogue of a resol...

متن کامل

On the domination polynomials of non P4-free graphs

A graph $G$ is called $P_4$-free, if $G$ does not contain an induced subgraph $P_4$. The domination polynomial of a graph $G$ of order $n$ is the polynomial $D(G,x)=sum_{i=1}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. Every root of $D(G,x)$ is called a domination root of $G$. In this paper we state and prove formula for the domination polynomial of no...

متن کامل

Paired-Domination in Subdivided Star-Free Graphs

A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and if the subgraph induced by S contains a perfect matching. The paired-domination number of G, denoted by γpr(G), is the minimum cardinality of a paired-dominating set of G. In [1], the authors gave tight bounds for paired-dominating sets of generalized claw-free graphs. Yet, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Forum of Mathematics, Sigma

سال: 2022

ISSN: ['2050-5094']

DOI: https://doi.org/10.1017/fms.2022.8